Some explorations on shortened computation
نویسندگان
چکیده
منابع مشابه
Some explorations in holomorphy.
In supersymmetric theories, one can obtain striking results and insights by exploiting the fact that the superpotential and the gauge coupling function are holomorphic functions of the model parameters. The precise meaning of this holomorphy is subtle, and has been explained most clearly by Shifman and Vainshtein, who have stressed the role of the Wilsonian eeective action. In this note, we ela...
متن کاملComputation on Zagreb Polynomial of Some Families of Dendrimers
In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...
متن کاملEvolving Finite State Transducers: Some Initial Explorations
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of evolving general finite state machines, there has been much less work on evolving FSTs. In particular, the fitness functions required for evolving FSTs are generally different to those used for FSMs. This paper considers...
متن کاملParallelizing Probabilistic Inference: Some Early Explorations
We report on an experimental investigation into opportunities for parallelism in belief net inference. Specifically, we report on a study performed of the available parallelism, on hypercube style machines, of a set of ran domly generated belief nets, using factoring (SPI) style inference algorithms. Our results indicate that substantial speedup is available, but that it is available only thr...
متن کاملSome Notes on Parallel Quantum Computation
We exhibit some simple gadgets useful in designing shallow parallel circuits for quantum algorithms We prove that any quantum circuit composed entirely of controlled not gates or of diagonal gates can be parallelized to logarithmic depth while circuits composed of both cannot Finally while we note the Quantum Fourier Transform can be parallelized to linear depth we exhibit a simple quantum circ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky a fysiky
سال: 1930
ISSN: 1802-114X
DOI: 10.21136/cpmf.1930.121537